The Three Gap Theorem (Steinhaus Conjecture)

نویسنده

  • Micaela Mayero
چکیده

We deal with the distribution of N points placed consecutively around the circle by a fixed angle of α. From the proof of Tony van Ravenstein [RAV88], we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N points partition the circle into gaps of at most three different lengths. We study the mathematical notions required for the proof of this theorem revealed during a formal proof carried out in Coq.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Three Gap Theorem (Steinhauss Conjecture)

We deal with the distribution of N points placed consecutively around the circle by a fixed angle of α. From the proof of Tony van Ravenstein [RAV88], we propose a detailed proof of the Steinhaus conjecture whose result is the following: the N points partition the circle into gaps of at most three different lengths. We study the mathematical notions required for the proof of this theorem reveal...

متن کامل

A two dimensional Steinhaus theorem

In 1958 this was proved independently by S. Swierczkowski [15] and by P. Erdos and V.T. Sos [12],[13]. It is often called the Steinhaus theorem or Steinhaus Conjecture. A useful way of viewing the result is to think of a circle of unit circumference with points placed around the perimeter at distances 0, 0:, ... , (N 1)0: from an arbitrary origin on the perimeter. Then the distances between adj...

متن کامل

Cone normed spaces

In this paper, we introduce the cone normed spaces and cone bounded linear mappings. Among other things, we prove the Baire category theorem and the Banach--Steinhaus theorem in cone normed spaces.

متن کامل

Regular Steinhaus graphs of odd degree

A Steinhaus matrix is a binary square matrix of size n which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy ai,j = ai−1,j−1+ai−1,j for all 2 6 i < j 6 n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states...

متن کامل

Steinhaus’ Problem on Partition of a Triangle

H. Steinhaus has asked whether inside each acute triangle there is a point from which perpendiculars to the sides divide the triangle into three parts of equal areas. We present two solutions of Steinhaus’ problem. The n-dimensional case of Theorem 1 below was proved in [6], see also [2] and [4, Theorem 2.1, p. 152]. For an earlier mass-partition version of Theorem 1, for bounded convex masses ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999